An Algorithm for Constructing a Planar Layout of a Graph with a Regular Polygon as Outer Face
نویسندگان
چکیده
Read’s algorithm for constructing a planar layout of a graph G produces a straight-line embedding of G, by using a sequence of triangulations. Let F denote any face of G. In this paper, Read’s algorithm is modified. A straight-line embedding is constructed in which F forms the outer face, such that its vertices lie on a convex regular polygon. It is proved that the method always works. Usually F is taken as the face of largest degree. The complexity of the algorithm is linear in the number of vertices of G.
منابع مشابه
An application of geometrical isometries in non-planar molecules
In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.
متن کاملExtended Rectangular Drawings of Plane Graphs with Designated Corners
In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segment, and all faces including the outer face are drawn as rectangles. In this paper, we introduce an “extended rectangular drawing” in which all inner faces are drawn as rectangles but the outer face is drawn as a rectilinear polygon with designated corners, and give a necessary and sufficient cond...
متن کاملOctagonal Drawings of Plane Graphs with Prescribed Face Areas
a r t i c l e i n f o a b s t r a c t An orthogonal drawing of a plane graph is called an octagonal drawing if each inner face is drawn as a rectilinear polygon of at most eight (polygonal) vertices and the contour of the outer face is drawn as a rectangle. A slicing graph is obtained from a rectangle by repeatedly slicing it vertically and horizontally. A slicing graph is called a good slicing...
متن کاملDrawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential area, our method produces drawings with polynomial area. In addition, we allow for collinear points on the boundary, provided such vertices do not create overlap...
متن کاملLinear - Time Algorithms for Proportional Contact Graph Representations ?
In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs of polygons. In this paper we study proportional contact representations that use rectilinear polygons without wasted areas (white space). In this setting, the best known algo...
متن کامل